Entropy decoding method, and decoding apparatus using same

ABSTRACT

The present invention relates to an entropy decoding method and to a decoding apparatus using same. The entropy decoding method according to the present invention comprises: a step of decoding a bin of a syntax element; and a step of acquiring information on the syntax element based on the decoded bin. In the step of decoding the bin, context-based decoding or bypass decoding is performed for each bin of the syntax element.

This application is a continuation of Ser. No. 14/009,150, filed Dec.23, 2013, which is a U.S. National Phase Application under 35 USC §371of International Application No. PCT/KR2012/002430 filed Mar. 20, 2012,which claims the benefit of U.S. Provisional Application No. 61/470,502filed Apr. 1, 2011 and U.S. Provisional Application No. 61/582,804 filedon Jan. 3, 2012, which are hereby incorporated by reference in itsentirety.

TECHNICAL FIELD

The present invention relates to a video compressing technique, and moreparticularly, to a method of performing entropy coding(encoding/decoding) and a device using the method.

BACKGROUND ART

In recent years, demands for a high-resolution and high-quality imagehave increased in various fields of applications. As an image has ahigher resolution and higher quality, an amount of data on the videoincreases more and more. Accordingly, when video data is transferredusing media such as existing wired or wireless broadband lines or videodata is stored in existing storage media, the transfer cost and thestorage cost of data increase.

In order to effectively transfer, store, and reproduce information onhigh-resolution and high-quality images, high-efficiency videocompression techniques can be utilized.

In order to enhance video compression efficiency, a method of predictinginformation of a current block using information of neighboring blocksof the current block without transferring the information of the currentblock can be used.

Inter prediction and intra prediction can be used as the predictionmethod. In the inter prediction, pixel values of a current picture arepredicted with reference to information of other pictures. In the intraprediction, pixel values of a current picture are predicted usinginter-pixel relationships in the same picture. When the inter predictionis performed, information indicating a reference picture and informationindicating a motion vector from the neighboring blocks in an interprediction mode can be utilized to designate a part of another pictureto be used for the prediction.

An encoding device entropy-encodes video information including theprediction result and transmits the encoded video information along witha bitstream. A decoding device entropy-decodes the received bitstreamand reconstructs the video information.

It is possible to enhance compression efficiency of video informationthrough the use of entropy encoding and entropy decoding.

SUMMARY OF THE INVENTION Technical Problem

An object of the invention is to provide a method and a device foreffectively performing entropy coding to enhance coding efficiency.

Another object of the invention is to provide a method and a device foreffectively utilizing contexts in entropy coding.

Another object of the invention is to provide a method and a device forutilizing different contexts depending on states and conditions inentropy coding.

Solution to Problem

(1) According to an aspect of the invention, there is provided anentropy decoding method including the steps of: decoding bins of asyntax element; and obtaining information on the syntax element on thebasis of the decoded bins, wherein the step of decoding the binsincludes performing context-based decoding or bypass decoding on a binof the syntax element. At this time, the context may be adaptivelycalculated or may have a predetermined fixed value.

(2) In (1), the step of decoding the bins may include applyingindependent context to the bin of the syntax element.

(3) In (1), the step of decoding the bins may include applying a bypassmode to some bins of the bins of the syntax element and applyingindependent contexts to the other bins.

(4) In (1), the step of decoding the bins may include applyingindependent context to the bin which is decoded on the basis of contextand the independent context may be a context which is updatedindependently of the other contexts.

(5) In (1), the step of decoding the bins may include determiningwhether the bin of the syntax element is to be bypass-decoded andperforming decoding based on contexts when it is determined that the binis not bypass-decoded.

(6) In (1), the step of decoding the bins may include performingdecoding on the basis of context index allocated to the bin of thesyntax element with a context index table on which the context indicesare allocated to the bins of the syntax element.

(7) In (6), the context index table may allocate the same context indexto some bins of the bins of the syntax element.

(8) In (6), the context index table may allocate the same context indexto some bins of the bins of the syntax element and may allocate a bypassmode to some bins.

(9) In (1), the step of decoding the bins includes performing decodingusing a context index table.

The context index table may allocate context indices and an offset basedon the type of a picture to be coded to the bins of the syntax element,and the bin of the syntax element may be decoded on the basis of acontext indicated by the sum of the context index and the offset.

(10) In (9), the context index table may allocate the same context indexto some bins of the bins of the syntax element.

(11) In (9), the context index table may allocate the same context indexto some bins of the bins of the syntax element and may allocate a bypassmode to some bins.

(12) According to another aspect of the invention, there is provided anentropy decoding device including: an entropy decoding module thatdecodes bins of a syntax element; and a prediction module that generatesa prediction block on the basis of the decoded syntax element, whereinthe entropy decoding module performs context-based decoding or bypassdecoding on a bin of the syntax element.

(13) In (12), the entropy decoding module may apply a bypass mode tosome bins of the bins of the syntax element and may apply independentcontexts to the other bins.

(14) In (12), the entropy decoding module may perform decoding on thebasis of context index allocated to the bin of the syntax element with acontext index table on which the context indices are allocated to thebins.

(15) In (12), the entropy decoding module may perform decoding using acontext index table, the context index table may allocate contextindices and an offset based on the type of a picture to be coded to thebins of the syntax element, and the bin of the syntax element may bedecoded on the basis of a context indicated by the sum of the contextindex and the offset.

Advantageous Effects

According to the invention, it is possible to effectively performentropy coding to enhance coding efficiency.

According to the invention, it is possible to enhance coding efficiencyof entropy coding by effectively utilizing contexts in performing theentropy coding.

According to the invention, it is possible to enhance coding efficiencyof entropy coding by reflecting states and conditions in performing theentropy coding and applying different contexts.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram schematically illustrating a video encodingdevice (encoder) according to an embodiment of the invention.

FIG. 2 is a block diagram schematically illustrating a video decodingdevice (decoder) according to an embodiment of the invention.

FIG. 3 is a diagram schematically illustrating an example of intraprediction modes used for intra prediction.

FIG. 4 is a diagram schematically illustrating an example of entropycoding according to the invention.

FIG. 5 is a flowchart schematically illustrating an example of anentropy decoding procedure according to the invention.

DESCRIPTION OF EXEMPLARY EMBODIMENTS

The invention can be variously modified in various forms and can havevarious embodiments, and specific embodiments thereof will be describedin detail and shown in the drawings. However, the embodiments are notintended for limiting the invention. Terms used in the below descriptionare used to merely describe specific embodiments, but are not intendedfor limiting the technical spirit of the invention. An expression of asingular number includes an expression of a plural number, so long as itis clearly read differently. Terms such as “include” and “have” areintended for indicating that features, numbers, steps, operations,elements, components, or combinations thereof used in the belowdescription exist, and it should be thus understood that the possibilityof existence or addition of one or more different features, numbers,steps, operations, elements, components, or combinations thereof is notexcluded.

On the other hand, elements of the drawings described in the inventionare independently drawn for the purpose of convenience for explanationof different specific functions in a video encoding/decoding device, anddoes not mean that the elements are embodied by independent hardware orindependent software. For example, two or more elements out of theelements may be combined to form a single element, or one element may bedivided into plural elements. Embodiments in which the elements arecombined and/or divided belong to the scope of the invention withoutdeparting from the concept of the invention.

Hereinafter, exemplary embodiments of the invention will be described indetail with reference to the accompanying drawings.

FIG. 1 is a block diagram schematically illustrating a video encodingdevice (encoder) according to an embodiment of the invention. Referringto FIG. 1, a video encoding device 100 includes a picture dividingmodule 105, a prediction module 110, a transform module 115, aquantization module 120, a rearrangement module 125, an entropy encodingmodule 130, a dequantization module 135, an inverse transform module140, a filter module 145, and a memory 150.

The picture dividing module 105 can divide an input picture into atleast one process unit. Here, the process unit may be a prediction unit(hereinafter, referred to as a “PU”), a transform unit (hereinafter,referred to as a “TU”), or a coding unit (hereinafter, referred to as a“CU”). In this specification, for the purpose of convenience forexplanation, a prediction unit may be expressed by a prediction block, atransform unit may be expressed by a transform block, and a coding unitmay be expressed by a coding block.

The prediction module 110 includes an inter prediction module thatperforms an inter prediction process and an intra prediction module thatperforms an intra prediction process. In order to enhance codingefficiency, a picture signal is not encoded without any change, but isencoded so as to reconstruct a picture by predicting a picture using apreviously-encoded area and adding residual values between an originalpicture and the predicted picture to the predicted picture.

As a picture including a previously-encoded area used for theprediction, an I picture (I slice), a P picture (P slice), a B picture(B slice), and the like are known. The I slice is a slice which isdecoded through only the intra prediction. The P slice is a slice whichcan be decoded through the inter prediction or the intra predictionusing at least one motion vector and a reference picture index topredict sample values of blocks. The B slice is a slice which can bedecoded through the inter prediction or the intra prediction using atleast two motion vectors and reference picture indices to predict samplevalues of blocks.

The prediction module 110 performs a prediction process on process unitsof a picture to create a prediction block including predicted samples.In the prediction module 110, the process unit of a picture may be a CU,a TU, or a PU. It can be determined whether the prediction performed onthe corresponding process unit is the inter prediction or the intraprediction, and specific details (for example, a prediction mode) of theprediction methods can be determined. The process unit subjected to theprediction process may be different from the process unit of which theprediction method and the specific details are determined. For example,the prediction method and the prediction mode may be determined by thePU units and the prediction process may be performed by the TU units.

In the inter prediction, a prediction process is performed on the basisof information on at least one of a previous picture and/or a subsequentpicture of a current picture to create a prediction block. In the intraprediction, a prediction process is performed on the basis of pixelinformation of a current picture to create a prediction block.

In the inter prediction, a reference picture is selected for a currentblock, and a reference block having the same size as the current blockis selected to create a prediction block of the current block. Forexample, in the inter prediction, a prediction block can be created soas to minimize a residual signal from the current block and to minimizethe magnitude of a motion vector. On the other hand, a skip mode, amerge mode, an AMVP (Advanced Motion Vector Prediction), or the like canbe used as the intra prediction method. The prediction block may becreated in the unit of pixel samples less than an integer pixel, such as½ pixel samples and ¼ pixel samples. Here, a motion vector can also beexpressed in the unit of pixel samples less than an integer pixel. Forexample, luma pixels can be expressed in the unit of ¼ pixels and chromapixels can be expressed in the unit of ⅛ pixels.

Information such as an index of a reference picture selected through theinter prediction, a motion vector predictor, and a residual signal isentropy-encoded and is transmitted to a decoder.

When the intra prediction is performed, the process unit subjected tothe prediction process may be different from the process unit of whichthe prediction method and the specific details are determined. Forexample, a prediction mode may be determined in the unit of PU and theprediction process may be performed in the unit of PU. Alternatively, aprediction mode may be determined in the unit of PU and the interprediction may be performed in the unit of TU.

The prediction modes in the intra prediction include 33 directionalprediction modes and at least two non-directional modes. Thenon-directional modes include a DC prediction mode and a planar mode.

In the intra prediction, a prediction block can be created after afilter is applied to reference samples. At this time, it can bedetermined whether a filter is applied to reference samples depending onthe intra prediction mode and/or the size of the current block.

A PU can be determined in various sizes/shapes from a CU which is notdivided any more. For example, in case of the inter prediction, a PU canhave sizes such as 2N×2N, 2N×N, N×2N, and N×N. In case of the intraprediction, a PU can have sizes such as 2N×2N and N×N (where N is aninteger). The PU having a size of N×N can be set to be applied to only aspecific case. For example, the PU having a size of N×N can be set to beused for only a coding unit having the smallest size or can be set to beused for only intra prediction. In addition to the PUs having theabove-mentioned sizes, PUs having sizes such as N×mN, mN×N, 2N×mN, andmN×2N (where m<1) may be additionally defined and used.

Residual values (a residual block or a residual signal) between thecreated prediction block and the original block are input to thetransform module 115. The prediction mode information, the motion vectorinformation, and the like used for the prediction are encoded along withthe residual values by the entropy encoding module 130 and aretransmitted to the decoder.

The transform module 115 performs a transform process on the residualblock in the unit of TU and creates transform coefficients. Thetransform unit in the transform module 115 may be a TU and may have aquad tree structure. The size of the transform unit can be determinedwithin a predetermined largest and smallest size range. The transformmodule 115 can transform the residual block using a DCT (Discrete CosineTransform) and/or a DST (Discrete Sine Transform).

The quantization module 120 can quantize the residual values transformedby the transform module 115 and can create quantization coefficients.The values calculated by the quantization module 120 can be supplied tothe dequantization module 135 and the rearrangement module 125.

The rearrangement module 125 can rearrange the quantization coefficientssupplied from the quantization module 120. By rearranging thequantization coefficients, it is possible to enhance the encodingefficiency in the entropy encoding module 130. The rearrangement module125 can rearrange the quantization coefficients in the form of atwo-dimensional block to the form of a one-dimensional vector throughthe use of a coefficient scanning method. The rearrangement module 125can enhance the entropy encoding efficiency in the entropy encodingmodule 130 by changing the order of coefficient scanning on the basis ofstochastic statistics of the coefficients transmitted from thequantization module.

The entropy encoding module 130 performs an entropy encoding process onthe quantization coefficients rearranged by the rearrangement module125. Examples of the entropy encoding method include an exponentialgolomb method, a CAVLC (Context-Adaptive Variable Length Coding) method,and a CABAC (Context-Adaptive Binary Arithmetic Coding) method. Theentropy encoding module 130 can encode a variety of information such asresidual coefficient information and block type information of a codingunit, prediction mode information, division unit information, predictionunit information, transfer unit information, motion vector information,reference picture information, block interpolation information, andfiltering information transmitted from the rearrangement module 125 andthe prediction module 110.

The entropy encoding module 130 may give a predetermined change to aparameter set or a syntax to be transmitted, if necessary.

The dequantization module 135 inversely quantizes the values quantizedby the quantization module 120. The inverse transform module 140inversely transforms the values inversely quantized by thedequantization module 135. The residual values created by thedequantization module 135 and the inverse transform module 140 aremerged with the prediction block predicted by the prediction module 110to create a reconstructed block.

The filter module 145 applies a deblocking filter, an ALF (Adaptive LoopFilter), an SAO (Sample Adaptive Offset) to the reconstructed picture.

The deblocking filter removes a block distortion generated at theboundary between blocks in the reconstructed picture. The ALF performs afiltering process on the basis of the resultant values of the comparisonof the original picture with the reconstructed picture of which theblocks are filtered by the deblocking filter. The ALF may be appliedonly when high efficiency is necessary. The SAO reconstructs offsetdifferences between the residual blocks having the deblocking filterapplied thereto and the original picture and is applied in the form of aband offset, an edge offset, or the like.

On the other hand, the filter module 145 may not perform a filteringprocess on a reconstructed block used for the inter prediction.

The memory 150 stores the reconstructed block or picture calculated bythe filter module 145. The reconstructed block or picture stored in thememory 150 is supplied to the prediction module 110 that performs theinter prediction.

FIG. 2 is a block diagram schematically illustrating a video decodingdevice (decoder) according to an embodiment of the invention. Referringto FIG. 2, a video decoding device 200 includes an entropy decodingmodule 210, a rearrangement module 215, a dequantization module 220, aninverse transform module 225, a prediction module 230, a filter module235, and a memory 240.

When a picture bitstream is input from the encoder, the input bitstreamis decoded in the inverse order of the order in which video informationis processed by the encoder.

For example, when the video encoding device uses a variable lengthcoding (hereinafter, referred to as “VLC”) method such as the CAVLC toperform the entropy encoding process, the video decoding module 210 canimplement the same VLC table as the VLC table used in the video encodingdevice and can perform the entropy decoding process. When the videoencoding device uses the CABAC to perform the entropy encoding process,the entropy decoding module 210 can perform the entropy decoding processusing the CABAC to correspond thereto.

Information for creating a prediction block out of the informationdecoded by the entropy decoding module 210 is supplied to the predictionmodule 230, and the residual values entropy-decoded by the entropydecoding module are input to the rearrangement module 215.

The rearrangement module 215 rearranges the bitstream entropy-decoded bythe entropy decoding module 210 on the basis of the rearrangement methodin the video encoding device. The rearrangement module 215 reconstructsand rearranges coefficients expressed in the form of a one-dimensionalvector into coefficients in the form of a two-dimensional block. Therearrangement module 215 is supplied with information associated withthe coefficient scanning performed by the encoder and can perform therearrangement using a method of inversely scanning the coefficients onthe basis of the scanning order in which the scanning is performed bythe encoder.

The dequantization module 220 performs dequantization on the basis ofthe quantization parameters supplied from the encoder and the rearrangedcoefficient values of the block.

The inverse transform module 225 performs the inverse DCT and inverseDST of the DCT and DST, which has been performed by the transform moduleof the video encoding device, on the quantization result from the videoencoding device. The inverse transform is performed on the basis of atransfer unit or a division unit of a picture determined by the videoencoding device. The transform module of the video encoding deviceselectively performs the DCT and DST depending on plural informationelements such as the prediction method, the size of the current block,and the prediction direction, and the inverse transform module 225 ofthe video decoding device performs the inverse transform on the basis ofthe transform information on the transform performed by the transformmodule of the video encoding device.

The prediction module 230 creates a prediction block on the basis ofprediction block creation information supplied from the entropy decodingmodule 210 and the previously-decoded block and/or picture informationsupplied from the memory 240. The reconstructed block can be createdusing the prediction block created by the prediction module 230 and theresidual block supplied from the inverse transform module 225.

The specific prediction method performed by the prediction module 230 isthe same as the prediction method performed by the prediction module ofthe encoder.

When the prediction mode of a current block is an intra prediction mode,an intra prediction process of creating a prediction block can beperformed on the basis of pixel information of the current picture.

The prediction modes in the intra prediction include 33 directionalprediction modes and at least two non-directional modes. Thenon-directional modes include a DC prediction mode and a planar mode.

In the intra prediction, a prediction block can be created after afilter is applied to reference samples. At this time, it can bedetermined whether a filter is applied to reference samples depending onthe intra prediction mode and/or the size of the current block.

When the prediction mode for the current block is the inter predictionmode, at least one of a previous picture and a subsequent picture of thecurrent picture is used as a reference picture and the inter predictionprocess is performed on the current block on the basis of informationincluded in the reference picture. Specifically, in the interprediction, a reference picture for the current block is selected, areference block having the same size as the current block is selected,and a prediction block of the current block is created. For example, inthe inter prediction, a prediction block can be created so as tominimize the residual signal from the current block and to minimize themagnitude of a motion vector. Information of neighboring blocks of thecurrent picture is used to use the information of the reference picture.For example, the prediction block of the current block is created on thebasis of the information of the neighboring blocks through the use of askip mode, a merge mode, an AMVP (Advanced Motion Vector Prediction)mode, or the like.

The prediction block may be created in the unit of pixel samples lessthan an integer pixel, such as ½ pixel samples and ¼ pixel samples.Here, a motion vector can also be expressed in the unit of pixel samplesless than an integer pixel. For example, luma pixels can be expressed inthe unit of ¼ pixels and chroma pixels can be expressed in the unit of ⅛pixels.

Motion information necessary for the inter prediction of the currentblock, for example, information on motion vectors, reference pictureindices, and the like, can be derived from a skip flag, a merge flag,and the like received from the encoder.

The process unit subjected to the prediction process may be differentfrom the process unit of which the prediction method and the specificdetails are determined. For example, a prediction mode may be determinedin the unit of PU and the prediction process may be performed in theunit of PU. Alternatively, a prediction mode may be determined in theunit of PU and the inter prediction may be performed in the unit of TU.

The residual block output from the inverse transform module 225 is addedto the prediction block output from the prediction module 230 toreconstruct an original picture.

The reconstructed block and/or picture is supplied to the filter module235. The filter module 235 performs a deblocking filtering process, anSAO (Sample Adaptive Offset) process, and/or an adaptive loop filteringprocess on the reconstructed block and/or picture.

The memory 240 stores the reconstructed picture or block for use as areference picture or a reference block and supplies the reconstructedpicture to the output module.

Although not described for the purpose of convenience for explanation,the bitstream input to the decoder may be input to the entropy decodingmodule through a parsing step. The parsing step may be performed by theentropy decoding module.

In this specification, coding may be analyzed as encoding or decoding insome cases, and information may be understood to include all of values,parameters, coefficients, elements, and the like.

A “screen” or a “picture” may mean a unit for expressing an image of aspecific time zone, and a “slice”, a “frame”, or the like means a unitconstituting a part of a picture in actually coding a video signal andmay be mixed with a picture in some cases.

“Pixel” or “pel” may mean the minimum unit constituting an image (apicture). “Sample” can be used as a term representing the value of aspecific pixel. A sample can be divided into a luma component and achroma component and is generally used as a term including both. Thechroma component represents a difference between determined colors andgenerally includes Cb and Cr.

“Unit” is used as a term representing a basic unit of image processingor a specific position of an image, such as a prediction unit (PU) and atransform unit (TU), and can be mixed with terms “block” and “area” caseby case. In general cases, a block is used as a term representing a setof samples or transform coefficients arranged in M columns and N rows.

On the other hand, in case of the inter prediction mode, the decoder andthe encoder extract the motion information of a current block andperform the inter prediction on the current block on the basis of theextracted motion information.

A picture used for predicting a current block is referred to as areference picture or a reference frame. The area in the referencepicture can be expressed using a reference picture index (refIdx)indicating the reference picture and a motion vector.

A reference picture list for a current picture can be constructed bypictures used for prediction, and a reference picture index indicates aspecific reference picture in the reference picture list. The P picturerequires a single reference picture list such as reference list 0, andthe B picture requires two reference picture lists such as referencelist 0 and reference list 1.

Specifically, the I picture is a picture which is encoded/decodedthrough the intra prediction. The P picture is a picture which can beencoded/decoded through the inter prediction or the intra predictionusing at least one motion vector and a reference picture index topredict sample values of blocks. The B picture is a picture which can beencoded/decoded through the inter prediction or the intra predictionusing at least two motion vectors and reference picture indices topredict sample values of blocks.

The P picture requires one reference picture list, which is calledreference picture list 0 (L0).

The B picture is a picture which can be encoded through forward,backward, and bi-directional inter prediction, for example, using tworeference pictures. The B picture requires two reference picture lists,which are called reference picture list 0 (L0) and reference picturelist 1 (L1).

The inter prediction using a reference picture selected from L0 iscalled L0 prediction. The L0 prediction is used mainly for forwardprediction. The inter prediction using a reference picture selected fromL1 is called L1 prediction. The L1 prediction is used mainly forbackward prediction. The inter prediction using two reference picturesselected from L0 and L1 is called bi prediction.

The features of the I picture, the P picture, and the B picture can bedefined in the unit of slices, not in the unit of pictures. For example,an I slice having the feature of the I picture in the unit of slices, aP slice having the feature of the P picture, and a B slice having thefeature of the B picture can be defined.

For example, when the slice type of a current block is B and a colPic isselected from L0, or when the slice type of a current block is P, acolPic can be selected from L0. A slice (picture) in which referencepicture list L0 and reference picture list L1 are equal to each otherout of the B slices (B pictures) is called a GPB (Generalized P and B).

As described above with reference to FIGS. 1 and 2, the predictionmodule performs the intra prediction on the basis of pixel informationin a current picture and creates a prediction block of a current block.For example, the prediction module can predict pixel values of thecurrent block using pixels belonging to neighboring blocks of thecurrent block, for example, blocks located on the upper side of thecurrent block, blocks located on the left side of the current block, ablock located at the left-top corner of the current block, blockslocated on the left-lower side of the current block, and blocks locatedon the upper-right side of the current block.

In the intra prediction mode, various prediction modes can be useddepending on the positions of reference pixels and/or the predictionmethod used to predict the pixel values of the current block.

FIG. 3 is a diagram schematically illustrating an example of intraprediction modes used for the intra prediction.

Referring to FIG. 3, examples of the intra prediction modes includedirectional modes such as a vertical mode and a horizontal mode andnon-directional modes such as a DC mode and a planar mode.

Table 1 schematically shows indices indicating the intra predictionmodes shown in FIG. 3.

TABLE 1 Intra prediction mode Title of relevant prediction mode 0Intra_Planar 1 Intra_DC Others (2 . . . 34) Intra_Angular 35 Intra_FromLuma (used only for chroma)

In Table 1, numerals 0 to 35 in the intra prediction mode correspond tonumerical values of 0 to 35 shown in FIG. 3. Referring to Table 1 andFIG. 3, intra prediction mode 0 represents the planar mode, intraprediction mode 1 represents the DC mode, and both are non-directionalmodes. Intra prediction modes 2 to 34 represent modes based onprediction angles and are directional modes.

Intra prediction mode 35 as a non-directional mode is applied to onlychroma and represents a chroma prediction mode which is determined froma luma intra mode. In the DC mode, a prediction block is created byaveraging of the pixel values in a current block. In the angular mode(directional mode), the prediction is performed depending on anglesand/or directions determined in advance for the modes.

On the other hand, unlike the luma components, a limited number ofprediction modes may be used for the chroma components. For the purposeof convenience for explanation, the limited number of prediction modesused for the chroma components are called chroma prediction modecandidates. When the intra prediction in the chroma mode is performed,the prediction can be performed using one prediction mode of the chromaprediction mode candidates.

For example, the planar mode, the vertical mode, the horizontal mode,and the DC mode can be used as the chroma prediction mode candidates.

Table 2 schematically shows an example where the prediction mode for thechroma components of the current block is determined on the basis of aprediction mode for the luma components of the current block and aprediction mode indicator for the chroma components.

TABLE 2 IntraPred Mode[xB][yB] X intra_chroma_pred_mode 0 26 10 1 (0 <=X < 35) 0 34  0  0  0  0 1 26 34 26 26 26 2 10 10 34 10 10 3  1  1  1 34 1 4 LM LM LM LM LM 5  0 26 10  1 X

In Table 2, (xB, yB) represents the position of the top-left luma sampleof the current block relative to the top-left sample of the currentpicture, and IntraPredMode represents the intra prediction mode for theluma samples of the current block. On the other hand,intra_chroma_pred_mode includes information for determi9ning the intraprediction mode for the chroma samples of the current block and can betransmitted from the encoder to the decoder.

The LM mode is also called a linear mode or a mode (luma-estimated mode)estimated from the modes for luma components. In the LM mode, the chromacomponents of the current block can be predicted using the luma samples(luma pixels) of the current block. For example, in the LM mode, thepredicted values of the chroma samples can be created on the basis ofthe samples created interpolating the reconstructed luma samples of thecurrent block.

Referring to Table 2, the prediction mode for the chroma components ofthe current block can be determined depending on the value ofintra_chroma_pred_mode and the value of the prediction modeIntraPredMode for the luma components of the current block. For example,when the value of intra_chroma_pred_mode is 0 and the value ofIntraPredMode is 0, the intra prediction mode for the chroma componentsof the current block is a prediction mode in the top-right direction(mode 34). When the value of IntraPredMode is not 0, the intraprediction mode for the chroma components of the current block is theplanar mode Intra_Planar. The chroma components of the current block arepredicted using the chroma components in the current picture dependingon the intra prediction mode.

Similarly, when the value of intra_chroma_pred_mode is 1 and the valueof IntraPredMode is 26, the intra prediction mode for the chromacomponents of the current block is a prediction mode in the top-rightdirection (mode 34). When the value of IntraPredMode is not 26, theintra prediction mode for the chroma components of the current block isthe vertical mode, that is, Intra_Angular(26). The chroma components ofthe current block are predicted using the chroma components in thecurrent picture depending on the intra prediction mode.

When the value of intra_chroma_pred_mode is 2 and the value ofIntraPredMode is 10, the intra prediction mode for the chroma componentsof the current block is a prediction mode in the top-right direction(mode 34). When the value of IntraPredMode is not 10, the intraprediction mode for the chroma components of the current block is ahorizontal mode, that is, Intra_Angular(10). The chroma components ofthe current block are predicted using the chroma components in thecurrent picture depending on the intra prediction mode.

When the value of intra_chroma_pred_mode is 3 and the value ofIntraPredMode is 1, the intra prediction mode for the chroma componentsof the current block is a prediction mode in the top-right direction(mode 34). When the value of IntraPredMode is not 1, the intraprediction mode for the chroma components of the current block is the DCmode Intra_DC. The chroma components of the current block are predictedusing the chroma components in the current picture depending on theintra prediction mode.

When the value of intra_chroma_pred_mode is 4, the intra prediction modefor the chroma components of the current block is the LM mode.Therefore, the prediction block for the chroma components of the currentblock can be created using the reconstructed luma components of thecurrent block.

When the value of intra_chroma_pred_mode is 5, the intra prediction modefor the chroma components of the current block is the same as the intraprediction mode for the luma components of the current block. Therefore,this case is called a DM (Direct Mode).

Table 3 schematically shows another example where the prediction modefor the chroma components of the current block is determined on thebasis of a prediction mode for the luma components of the current blockand a prediction mode indicator for the chroma components.

TABLE 3 IntraPred Mode[xB][yB] X intra_chroma_pred_mode 0 26 10 1 (0 <=X < 35) 0 34 0 0 0 0 1 26 34 26 26 26 2 10 10 34 10 10 3 1 1 1 34 1 4 026 10 1 X

Table 3 shows a case where the LM mode is not applied.

The decoder may selectively apply Table 2 and Table 3. For example, theencoder can transmit information indicating which of Table 2 and Table 3to apply to the decoder. The decoder can apply Table 2 or Table 3 todetermine the intra prediction mode for the chroma components of thecurrent block in response to the transmitted instruction.

On the other hand, video information including the predicted informationis subjected to the entropy encoding and is then transmitted with abitstream to the decoder as described with reference to FIG. 1. Asdescribed with reference to FIG. 2, the decoder obtains videoinformation including the predicted information by entropy-decoding thereceived bitstream.

FIG. 4 is a diagram schematically illustrating an example of the entropycoding module according to the invention. The configuration of theentropy coding module shown in FIG. 4 can be similarly applied to theentropy encoding and the entropy decoding.

When FIG. 4 shows an example of the entropy encoding module, the entropyencoding module 400 includes a binarization module 410, a regular codingengine 420, and a bypass coding engine 430.

Here, the entropy-encoding processes a signal input in the direction ofD1 and outputs the processed signal in the direction of D2.

When the input signal is not a binary value but a syntax element, thebinarization module 410 converts the input signal into a binary number.When the input signal is a binary number, the input signal may bypassthe binarization module 410.

A binary value which is an input single digit value is called a bin. Forexample, when the input binary value is 110, each of 1, 1, and 0 iscalled a bin and a binary sequence including the bins is called a binstring.

The binarized signal (bin string) is input to the regular coding engine420 or the bypass coding engine 430.

The regular coding engine 420 allocates context reflecting a probabilityvalue to the bin and encodes the bins on the basis of the allocatedcontexts. The regular coding engine 420 can update the context of thebin after encoding the bin.

The bypass coding engine 430 does not allocate contexts depending on theinput bins, but encodes the input bins in a simple bypass mode to raisethe encoding rate. In the bypass mode, the procedure of estimating theprobabilities for the input bins and the procedure of updating theprobabilities applied to the bins after the encoding are bypassed. Inthe bypass mode, for example, the encoding procedure can be performedusing a uniform probability distribution.

The entropy encoding module 400 determines whether the entropy encodingis performed through the use of the regular coding engine 420 or whetherthe entropy encoding is performed through the use of the bypass codingengine 430, and switches the encoding route through the use of theswitching module 440.

The entropy encoding module 400 may be the entropy encoding module 130shown in FIG. 1.

When FIG. 4 shows an example of the entropy decoding module, the entropydecoding module 400 includes a binarization module 410, a regular codingengine 420, and a bypass coding engine 430.

The entropy decoding module 400 processes a signal input in thedirection of D3 and outputs the processed signal in the direction of D4.

The binarization module 410, the regular coding engine 420, and thebypass coding engine 430 perform the same procedures as described in theentropy encoding module in the reversed order.

For example, the entropy decoding module 400 determines whether the binof the input syntax element is decoded through the use of the regularcoding engine 420 or through the use of the bypass coding engine 430.

When it is determined that the regular coding engine is used, theregular coding engine 420 performs the decoding using contexts. When itis determined that the bypass coding engine is used, the bypass codingengine 430 performs the decoding using the uniform probabilitydistribution. A binary code is output by the decoding in the codingengines 420 and 430.

When all the bins of a specific syntax (syntax element) are completelydecoded by the coding engine, the binary codes output for all the binsof the syntax (syntax element) are summed and it is determined onto whatsyntax value the sum is mapped. When the output final binary code ismapped onto a specific syntax, the value of the binary code isdetermined to be the value of the mapped syntax.

At this time, the binarization module 410 can perform inversebinarization if necessary.

On the other hand, the decoder entropy-decodes the bitstream receivedfrom the encoder. Hereinafter, an entropy-decoding method which isperformed by the decoder when the encoder entropy-encodes videoinformation using the CABAC as an example of the entropy decodingaccording to the invention for the purpose of convenience forexplanation will be described.

The decoder, for example, the entropy decoding module of the decoder,starts a CABAC parsing procedure in response to a request for the valueof the syntax element, when parsing the syntax element encoded in theCABAC.

specifically, binarization of the value of the syntax element is derivedin response to a request for the value of the syntax element. In thecourse of binarization, the binarization is performed depending on theapplied binarization type (for example, unary binarization, truncatedunary binarization, Exp-Golomb binarization, and fixed lengthbinarization.

The binarization of the syntax element and the sequence of the parsedbins determine the decoding process. The bin of the binarized value ofthe syntax element is indexed by bin index binIdx, and context indexctxIdx of the bin is derived. The initial value of the context index canbe set by the syntax element. In this case, a context index table inwhich the values of context indices are set by the syntax elements canbe used, and the table can be specified using a predetermined indicator,for example, a context index table indicator ctxIdxTable.

An arithmetic decoding process is started for each context index.

FIG. 5 is a flowchart schematically illustrating an example of theentropy decoding process according to the invention. For the purpose ofconvenience for explanation, a decoding process on a single bin isillustrated an example in FIG. 5.

The decoding process shown in FIG. 5 can be performed by the decoder,specifically, the entropy decoding module in the decoder. Here, for thepurpose of convenience for explanation, it is assumed that the entropydecoding module performs the process steps.

Referring to FIG. 5, the entropy decoding module determines whetherbypass decoding is applied to the input bin to be decoded (S510). Theentropy decoding module can determine whether the bypass decoding isapplied on the basis of information on the bin to be decoded. Forexample, as described later, when fixed contexts are used using a table,the entropy decoding module may determine whether the bypass decoding isapplied on the basis of an instruction allocated to the syntax elementin the table. When the fixed contexts are used using a table, theentropy decoding module may determine whether the bypass decoding isapplied on the basis of indices, offsets, and the like allocated to thesyntax element in the table.

When it is determined that the bypass decoding is applied, the entropydecoding module performs the bypass decoding on the input bin (S520).Similarly to the encoding, a uniform probability distribution is used toperform the bypass decoding. The entropy decoding module can compare acode interval range codIRange and a code interval offset codIOffsetdepending on the state of the bypass decoding engine and can allocatethe values of the bins thereto. For example, 1 is allocated as the valueof the bin when the code interval offset is equal to or larger than thecode interval range, and 0 is allocated as the value of the bin when thecode interval offset is smaller than the code interval range. At thistime, in order to directly compare the code interval range and the codeinterval offset, the value of the code interval range or the codeinterval offset may be appropriately adjusted.

When it is determined in step S510 that the bypass decoding is notperformed, the entropy decoding module determines whether a decoding endcondition is satisfied (S530). For example, when the value of a contextindex ctxIdx is 0 and the value of a context index table ctxIdxTable is0, the entropy decoding module ends the decoding process. Whether theend condition is satisfied may not be determined depending on the indexvalues but syntax information such as a flag may be transmitted from theencoder. At this time, the end condition indicated by the syntaxinformation and the end condition determined depending on the indexvalues may be equal to each other.

When the end condition is satisfied, the entropy decoding module endsthe decoding process as described above (S540). Then entropy decodingmodule may allocate a predetermined set value as the value of the binbefore the ending. At this time, the entropy decoding module mayallocate the value of the bin through the bypass decoding.

When the end condition is not satisfied, the entropy decoding moduleperforms the decoding (S550). The entropy decoding module decodes thebins to be decoded on the basis of the bin index binIdx indicating thebin to be decoded and the context index ctxIdx indicating the contextapplied to the bin to be decoded.

Hereinafter, the method of performing decoding using contexts will bedescribed in detail.

As described above, when video information requiring high codingefficiency is processed, entropy coding (entropy encoding/entropydecoding) can be used. In addition to the basic coding methods such asExp-Golomb, a variable length coding (VLC) or the above-mentionedcontext-based adaptive binary arithmetic coding (CABAC) can be used forthe entropy coding.

In the CABAC, “context-based” means that a coding method having higherefficiency is adaptively selected and applied in consideration ofcircumstances. In this regard, use of different contexts means thatdifferent probability models are applied for the coding through the useof independent context update.

The following methods can be preferentially considered as the method ofusing contexts for the coding in the CABAC.

<Method of Using Context>

(a) Method of calculating contexts depending on the circumstances andadaptively using the calculated context for the coding.

(b) Method of defining a specific context table in advance so as to usefixed contexts and using context designated in the defined table.

(c) Bypass coding (encoding/decoding) method of coding(encoding/decoding) a binary code without referring to contexts.

(d) Method of selectively combining and using the methods of (a) to (c).

The method of (1) out of the context using methods accompanies with aprocess of calculating a context in consideration of circumstancesbefore the coding and thus has the highest complexity. The encoder cancalculate a context for each bin of the binary code of the syntaxelement to be coded in consideration of the circumstances, for example,the contexts applied to the previous and subsequent bins or the contextsof the block (for example, the left block or the top block) codedearlier than the current block. The encoder transmits information on thecalculated contexts to the decoder. The decoder decodes the bin on thebasis of the received context information.

Instead of causing the encoder to determine and transmit the contexts ofthe bins, the encoder and the decoder may calculate the contexts inconsideration of the circumstances using the same method.

The method of (b) out of the context using methods is a method ofsetting a context table in which context indices are allocated to thebins of the binary code of a specific syntax element in advance andusing the context indicated by the context index allocated in thecontext table to decode the corresponding bin, instead of calculatingthe context every time as in the method of (a). When the method of (b)is used, fixed contexts may be used for the bins.

Table 4 schematically shows an example where bin indices and contextindices are designated when the method of (b) is used.

TABLE 4 Bin index (binIdx) Syntax element 0 1 2 3 4 Context index by binIdx0 Idx1 Idx2 Idx3 Idx4

Table 4 shows an example of a context table applied to a specific syntaxelement when the specific syntax element is assumed.

In the example of Table 4, the bin index binIdx indicates a specific binout of the bins constituting the binary code of a syntax element. Forexample, the value of binIdx of 0 indicates the 0-th bin of the binsconstituting the binary code of the syntax element, and the value ofbinIdx of 4 indicates the third bin of the bins constituting the binarycode of the syntax element. The syntax element may be a syntax elementwhich is transmitted from the encoder to the decoder, such as merge_idx,intra_chroma_pred_mode, and inter_pred_flag.

Referring to Table 4, context indices are allocated to bins 0 to 4constituting the binary code of a syntax element. The context indicesIdx0 to Idx4 may have different values. The context indices indicatecontext to be applied to the bin. The contexts indicated by the contextindices are allocated in a particular table. For example, in particularcontext tables by syntax elements, a specific context indicated by acontext index may be allocated.

The bins of the syntax element are decoded on the basis of the contextsindicated by the allocated context indices.

When the syntax element is decoded, the decoder uses a context indicatedby the context index allocated to a specific bin for the correspondingbin. For example, when the value of the bin index is 0, the 0-th bin canbe decoded using the context indicated by Idx0.

Table 4 shows a case where the maximum value of the bin indicesbinIdxMax is 4, but the maximum value of the bin indices may be largerthan 4 or may be smaller than 4. The same context index as the contextindex allocated to the maximum bin index binIdxMax can be used for thebin index larger than the maximum value.

The method of (c) of the context using methods has complexity higherthan that of the method of (a) or (b). The bypass coding used in themethod of (c) uses a uniform probability distribution as described aboveand is applied for rapid coding. Details of the bypass coding are thesame as described above.

In CABAC coding of a specific binary code, a context is applied to thenumeral 0 or 1 of each digit of the binary code. At this time, numeral 0or 1 of each digit of the binary code is called a bin as describedabove. For example, when the binary code is 110, the 0-th bin is 1, thefirst bin is 1, and the second bin is 0.

In the CABAC coding, contexts for the bins constituting the binary codeof the syntax element can be determined in various ways.

<Method of Determining Context for a Bin Constituting Binary Code>

(A) Independent contexts may be applied to each of the bins constitutingthe binary code of a syntax element.

(B) The same context may be commonly applied to the bins constitutingthe binary code of the syntax element.

(C) The bins constituting the binary code of the syntax element may becoded (bypass-coded) in the bypass mode.

(D) The methods of (A) to (C) can be combined to determine contexts forthe bins constituting the binary code of the syntax element.

In the method of (A), independent contexts may be applied to each of thebins constituting the binary code of the syntax element. Therefore, thecontext for the bin can be independently updated. In the method of (B),the same context may be applied to the bins constituting the binary codeand can be updated in the same way. In the method of (C), since all thebins constituting the binary code are coded in the bypass mode, rapiddecoding can be achieved.

According to the method of (D), the methods of (A) to (C) can becombined and applied. For example, independent contexts may be appliedto some bins of the bins constituting the binary code of the syntaxelement and the same context may best applied to some bins. Independentcontexts may be applied to some bins of the bins constituting the binarycode of the syntax element and the bypass mode may be applied to somebins. The same context may be applied to some bins of the binsconstituting the binary code of the syntax element and the bypass modemay be applied to some bins. Independent contexts may be applied to somebins of the bins constituting the binary code of the syntax element, thesame context may be applied to some bins, and the bypass mode may beapplied to some bins.

On the other hand, the context determining methods (A) to (D) for thebins constituting the binary code of the syntax element may be appliedalong with the context using methods (a) to (d).

For example, on the basis of the method of (A), independent contexts maybe applied to all the bins constituting the binary code of a specificsyntax (syntax element) and the applied independent context can becalculated in consideration of the circumstances of the bin to beapplied.

In a specific syntax (syntax element), independent contexts may beapplied to all the bins constituting the binary code of thecorresponding syntax (syntax element) and the applied independentcontexts may be indicated by a predetermined context table.

Table 5 shows an example where contexts are allocated using apredetermined context table when independent contexts are allocated tothe bins constituting the binary code of a syntax element.

TABLE 5 Bin index (binIdx) Syntax element A 0 1 2 3 4 Context index bybin Idx0 Idx1 Idx2 Idx3 Idx4

Table 5 shows an example of a context table applied to specific syntaxelement A when the syntax element A is assumed.

In Table 5, context indices by bins Idx0 to Idx4 independently indicatecontexts to be applied to the bins, and the context indicated by thecontext index can be independently updated.

Table 5 shows an example where the maximum value of the bin indicesbinIdxMax is 4, but the maximum value of the bin indices may be largerthan 4 or may be smaller than 4. The same context index as the contextindex allocated to the maximum bin index binIdxMax can be used for thebin index larger than the maximum value.

On the other hand, independent contexts are applied to some bins of thebins constituting the binary code of a specific syntax (syntax element)and the bypass mode is applied to some bins.

At this time, when context is applied to the corresponding bin, thecontext applied to the bin can be calculated in consideration of thecircumstances.

In a predetermined context table, independent contexts or the bypassmode may be set by bins, and it may be indicated what context to applyor whether to apply the bypass mode by the context indices by bins.

Table 6 shows an example of a context table which can be used in a casewhere independent contexts are applied to some bins of the binsconstituting the binary code of a specific syntax (syntax element) andthe bypass mode is applied to some bins.

TABLE 6 Bin index (binIdx) Syntax element B 0 1 2 3 4 Context index bybin Idx0 bypass Idx1 bypass Idx2

Table 6 shows an example of a context table applied to specific syntaxelement B when the syntax element B is assumed.

In the example of Table 6, independent contexts are applied to the 0-th,second, and fourth bins of the bins constituting the binary code ofsyntax element B and the bypass mode is applied to the first and thirdbins.

Table 6 shows an example where the maximum value of the bin indicesbinIdxMax is 4, but the maximum value of the bin indices may be largerthan 4 or may be smaller than 4. The same context index as the contextindex allocated to the maximum bin index binIdxMax can be used for thebin index larger than the maximum value.

On the basis of the methods of (A) and (B), independent contexts may beapplied to some bins of the bins constituting the binary code of aspecific syntax (syntax element), the same context may be commonlyapplied to some bins, and the context may be calculated in considerationof the circumstances of the bin to be applied.

In a specific syntax (syntax element), independent contexts may beapplied to some bins of the bins constituting the binary code of thecorresponding syntax (syntax element), the same context may be commonlyapplied to some bins, and the contexts may be indicated by apredetermined context table.

Table 7 shows an example where contexts are applied using a contexttable in a case where independent contexts are applied to some bins ofthe bins constituting the binary code of a syntax element and the samecontext is commonly applied to some bins.

TABLE 7 Bin index (binIdx) Syntax element C 0 1 2 3 4 Context index bybin Idx0 Idx1 Idx1 Idx2 Idx3

Table 7 shows an example of a context table applied to specific syntaxelement C when the syntax element C is assumed.

In Table 7, the same context indicated by the context index Idx1 isapplied to the first and second bins. Contexts indicated by the contextindices Idx1, Idx2, and Idx3 are applied to the 0-th, third, and fourthbins. The context indices Idx0 to Idx3 may have different values and thecontext indicated by the context index can be independently updated.

Table 7 shows an example where the maximum value of the bin indicesbinIdxMax is 4, but the maximum value of the bin indices may be largerthan 4 or may be smaller than 4. The same context index as the contextindex allocated to the maximum bin index binIdxMax can be used for thebin index larger than the maximum value.

On the other hand, in a specific syntax (syntax element), independentcontexts may be applied to some bins of the bins constituting the binarycode of the corresponding syntax (syntax element), the same context maybe commonly applied to some bins, and the bypass mod may be applied tosome bins.

At this time, when context is applied to the corresponding bin, thecontext applied to the bin can be calculated in consideration of thecircumstances. In a predetermined context table, independent contexts orthe bypass mode may be set by bins, and it may be indicated what contextto apply or whether to apply the bypass mode by the context indices bybins.

Table 8 shows an example of a context table which can be used in a casewhere independent contexts are applied to some bins of the binsconstituting the binary code of a specific syntax (syntax element), thesame context is commonly applied to some bins, and the bypass mode isapplied to some bins.

TABLE 8 Bin index (binIdx) Syntax element D 0 1 2 3 4 Context index bybin Idx0 bypass Idx1 Idx2 Idx2

Table 8 shows an example of a context table applied to specific syntaxelement D when the syntax element D is assumed.

In Table 8, the context indicated by the context index Idx0 is appliedto the 0-th bin of the bins constituting the binary code of syntaxelement D, the bypass mode is applied to the first bin, the contextindicated by the context index Idx1 is applied to the second bin, andthe context indicated by the context index Idx2 is applied to the thirdbin and the fourth bin.

Table 8 shows an example where the maximum value of the bin indicesbinIdxMax is 4, but the maximum value of the bin indices may be largerthan 4 or may be smaller than 4. The same context index as the contextindex allocated to the maximum bin index binIdxMax can be used for thebin index larger than the maximum value.

On the basis of the method of (B), the same context may be commonlyapplied to the bins constituting the binary code of a specific syntax(syntax element). At this time, the common context can be calculated inconsideration of the circumstances at the time of application to thebins. The common context may be allocated using a predetermined contexttable constructed in advance.

Table 9 shows an example of a context table which can be used in a casewhere the same context is applied to the bins constituting the binarycode of a specific syntax (syntax element).

TABLE 9 Bin index (binIdx) Syntax element E 0 1 2 3 4 Context index bybin Idx0 Idx0 Idx0 Idx0 Idx0

Table 9 shows an example of a context table applied to specific syntaxelement E when the syntax element E is assumed.

In Table 9, the context indicated by the context index Idx0 is commonlyapplied to the bins constituting the binary code of syntax element E.

Table 9 shows an example where the maximum value of the bin indicesbinIdxMax is 4, but the maximum value of the bin indices may be largerthan 4 or may be smaller than 4. The same context index as the contextindex allocated to the maximum bin index binIdxMax can be used for thebin index larger than the maximum value.

In a specific syntax (syntax element), the same context may be appliedto some bins of the bins constituting the binary code of thecorresponding syntax (syntax element) and the bypass mode may be appliedto some bins.

At this time, when context is applied to the corresponding bin, thecontext can be calculated in consideration of the circumstances. In apredetermined context table constructed in advance, the common contextor the bypass mode may be set for some bins, and the context or thebypass mode may be indicated by the context indices.

Table 10 shows an example of a context table which can be used in a casewhere the same context is applied to some bins of the bins constitutingthe binary code of a specific syntax (syntax element) and the bypassmode is applied to some bins.

TABLE 10 Bin index (binIdx) Syntax element F 0 1 2 3 4 Context index bybin Idx0 Idx0 bypass Idx0 Idx0

Table 10 shows an example of a context table applied to specific syntaxelement F when the syntax element F is assumed.

In Table 10, the bypass mode is applied to the second bin of the binsconstituting the binary code of syntax element F and the contextindicated by the context index Idx0 is applied to the 0-th, first,third, and fourth bins.

Table 10 shows an example where the maximum value of the bin indicesbinIdxMax is 4, but the maximum value of the bin indices may be largerthan 4 or may be smaller than 4. The same context index as the contextindex allocated to the maximum bin index binIdxMax can be used for thebin index larger than the maximum value.

On the basis of the method of (C), the bypass mode may be applied to allthe bins constituting the binary code of a specific syntax (syntaxelement). In this case, the application of the bypass mode to thecorresponding syntax (syntax element) can be indicated using a contexttable constructed in advance. At this time, the context table can beconstructed in such a manner that the bypass mode is allocated to allthe bin indices.

In the bins constituting the binary code of a specific syntax (syntaxelement), different contexts may be applied to the same bin. Forexample, plural different context indices may be allocated to the samebin index in the context table.

The context index may vary depending on the circumstances (state orcondition) in which the syntax (syntax element) is applied. For example,depending on the states or conditions such as the type of a block towhich the syntax (syntax element) is applied, the type of a picture(slice, frame), a prediction mode, a block size, and a block depth,different contexts may be applied to the bin at the same position in thebinary code. At this time, a certain state may be specified by anotherequivalent state. For example, the block size may be specified by theblock depth, or the block depth may be specified by the block size.Therefore, two conditions may be a state or condition for specifying thesame circumstance.

When a common context is applied to different contexts are applieddepending on the picture (slice, frame) type, different context indicescan be allocated to the same bin index depending on whether a picture(slice, frame) is an I picture (slice, frame), a P picture (slice,frame), or a B picture (slice, frame).

Hereinafter, a case where different contexts (context indices) can beapplied to the same bin index will be specifically described.

A syntax element can has a binary code (codeword) value includingpredetermined bins as described above. For example, in case of the intraprediction for chroma components, 5 or 6 prediction modes are alloweddepending on whether the LM mode is applied, as described with referenceto Tables 2 and 3. Therefore, the syntax element intra_chroma_pred_modeindicating the intra prediction mode for the chroma components can have5 to 6 different binary code (codeword) values.

Table 11 shows intra prediction modes which can be used for predictionof the chroma components and binary codes (codewords) of the syntaxelement intra_chroma_pred_mode indicating the intra prediction modeswhen the LM mode is used.

Table 12 shows intra prediction modes which can be used for predictionof the chroma components and binary codes (codewords) of the syntaxelement intra_chroma_pred_mode indicating the intra prediction modeswhen the LM mode is not used.

TABLE 11 Mode indices codeword 0 0 1 10 2 110 3 1110 4 11110 5 11111

TABLE 12 Mode Indices codeword 0 0 1 10 2 110 3 1110 4 1111

As shown in Table 11 or 12, contexts can be allocated to the binsconstituting binary codes (codewords) of a predetermined syntax elementin the above-mentioned way.

The context table can be used for the bins constituting a codeword so asto apply different contexts to the same bin depending on the state orcondition. In this case, a context applied to a specific bin can beindicated by the sum of the index values allocated to the bin indicesand the offset value added thereto depending on the condition in thecontext table. Accordingly, in this case, the indicator indicating thecontext can be said to be the sum of the offset value and the indexvalue indicated by each bin index. For the purpose of convenience forexplanation, the index value indicated by the corresponding bin iscalled a context index by bin and the index indicating the context to beapplied to the corresponding bin is called a context index for bin(ctxIdx).

Table 13 shows an example of a context table which can be used in a casewhere the state information or the condition is reflected in the samebin and different contexts are applied thereto.

TABLE 13 Context index by bin Offset 0 1 2 3 4 A1 B0 B1 B2 B3 B4 A2 B0B1 B2 B3 B4 A3 B0 B1 B2 B3 B4

In Table 13, numerals 0 to 4 represent bin index values (binIdx). Theoffset values A1, A2, and A3 may be different from each other as in anexample to be described later. All or some of the context indices bybin, that is, the indices (context indices by bin) B0, B1, B2, B3, andB4 allocated by bin indices, may have different values.

Table 13 shows an example where the maximum value of the bin indicesbinIdxMax is 4, but the maximum value of the bin indices may be largerthan 4 or may be smaller than 4. The same context index as the contextindex allocated to the maximum bin index binIdxMax can be used for thebin index larger than the maximum value.

As described above, the offset value can be set depending on apredetermined state or condition. For example, when the offset value isset depending on the picture (slice, frame) type, A1 may be an offsetfor the I picture (slice, frame), A2 may be an offset for the P picture(slice, frame), and A3 may be an offset for the B picture (slice,frame).

The offset value may be determined directly from the state informationor the condition such as the picture (slice, frame) or may be determinedusing a parameter value such as a predetermined type value determineddepending on the state information or the condition such as the picture(slice, frame) type.

By using the offset value, different contexts can be allocated to thebins with reflection of the state information or the condition. WhenTable 13 is assumed for a predetermined syntax (syntax element), thevalues of A1, A2, and A3 are different from each other, and the valuesof B0, B1, B2, B3, and B4 are different from each other, differentcontexts can be allocated to the bins constituting a codeword (binarycode) of a predetermined syntax (syntax element).

Table 14 shows an example of a context table which can be used in a casewhere the offset value is set differently depending on the picture(slice, frame) and different contexts are allocated to the bins.

TABLE 14 Context index by bin Type Offset 0 1 2 3 4 I 0 0 1 2 3 4 P 5 01 2 3 4 B 10 0 1 2 3 4

Table 14 shows an example where the offset value and the context indexvalue by bin in Table 13 are specifically set. The offset values and thecontext index values by bin in Table 14 can be set to be different fromthe values shown in Table 14 so as to indicate suitable contexts.

By applying different offsets depending on the state information or thecondition, different contexts depending on the condition may beallocated and the same context may be commonly applied to some bins ofthe bins constituting a codeword of a syntax (syntax element). Forexample, when Table 13 is assumed for a predetermined syntax (syntaxelement), some of the values of B0, B1, B2, B3, and B4 can be set tohave the same value.

Table 15 shows an example of a context table which can be used in a casewhere the offset value is set differently depending on the picture(slice, frame) and the same context is commonly applied to some bins ofthe bins constituting a codeword of a syntax (syntax element).

TABLE 15 Context index by bin Type Offset 0 1 2 3 4 I 0 0 1 1 2 3 P 4 01 1 2 3 B 8 0 1 1 2 3

Table 15 shows an example where the offset value and the context indexvalue by bin in Table 13 are specifically set. The offset values and thecontext index values by bin in Table 15 can be set to be different fromthe values shown in Table 15 so as to indicate suitable contexts.

By applying different offsets depending on the state information or thecondition, different contexts depending on the condition may beallocated, independent contexts may be applied to some bins of the binsconstituting a codeword of a syntax (syntax element), the same contextmay be commonly applied to some bins, and the bypass mode may be appliedto some bins. For example, when Table 13 is assumed for a predeterminedsyntax (syntax element), some of the values of B0, B1, B2, B3, and B4can be set to have the same value and some of the values of B0, B1, B2,B3, and B4 can be set to indicate the bypass mode instead of thespecific index values.

Table 16 shows an example of a context table which can be used in a casewhere the offset value is set so as to define different contextsdepending on the slice type, independent contexts are applied to somebins, the same context is commonly applied to some bins, and the bypassmode is applied to some bins.

TABLE 16 Context index by bin Type Offset 0 1 2 3 4 I 0 0 1 1 1 bypass P2 0 1 1 1 bypass B 4 0 1 1 1 bypass

When Table 16 is assumed to be applied to a predetermine syntax (syntaxelement), 0 is allocated as the context index by bin to the 0-th binconstituting the codeword of the corresponding syntax (syntax element)and 1 is allocated as the context index by bin to the first to thirdbins. The bypass mode is applied to the fourth bin.

Table 16 shows an example where the offset value and the context indexvalue by bin in Table 13 are specifically set. The offset values and thecontext index values by bin in Table 16 can be set to be different fromthe values shown in Table 16 so as to indicate suitable contexts.

By applying different offsets depending on the state information or thecondition, different contexts depending on the condition may beallocated, contexts may be applied to some bins of the bins constitutinga codeword of a syntax (syntax element), and the bypass mode may beapplied to the other bins. For example, when Table 13 is assumed for apredetermined syntax (syntax element), some of the values of B0, B1, B2,B3, and B4 can be set to index values and the other of the values of B0,B1, B2, B3, and B4 can be set to indicate the bypass mode instead of thespecific index values.

Table 17 shows an example of a context table which can be used in a casewhere the offset value is set so as to define different contextsdepending on the slice type, contexts are applied to some bins, and thebypass mode is applied to the other bins.

TABLE 17 Context index by bin Type Offset 0 1 2 3 4 I 0 0 bypass bypassbypass bypass P 1 0 bypass bypass bypass bypass B 2 0 bypass bypassbypass bypass

When Table 17 is assumed to be applied to a predetermine syntax (syntaxelement), 0 is allocated as the context index by bin to the 0-th binconstituting the codeword of the corresponding syntax (syntax element)and the bypass mode is applied to the first to fourth bins.

Table 17 shows an example where the offset value and the context indexvalue by bin in Table 13 are specifically set. The offset values and thecontext index values by bin in Table 17 can be set to be different fromthe values shown in Table 17 so as to indicate suitable contexts.

By applying different offsets depending on the state information or thecondition, different contexts depending on the condition may beallocated, independent contexts may be applied to some bins of the binsconstituting a codeword of a syntax (syntax element), and the bypassmode may be applied to the other bins. For example, when Table 13 isassumed for a predetermined syntax (syntax element), some of the valuesof B0, B1, B2, B3, and B4 can be set to different index values and theother of the values of B0, B1, B2, B3, and B4 can be set to indicate thebypass mode instead of the specific index values.

Table 18 shows an example of a context table which can be used in a casewhere the offset value is set so as to define different contextsdepending on the slice type, independent contexts are applied to somebins, and the bypass mode is applied to the other bins.

TABLE 18 Context index by bin Type Offset 0 1 2 3 4 I 0 0 1 bypassbypass bypass P 2 0 1 bypass bypass bypass B 4 0 1 bypass bypass bypass

When Table 18 is assumed to be applied to a predetermine syntax (syntaxelement), 0 is allocated as the context index by bin to the 0-th binconstituting the codeword of the corresponding syntax (syntax element),1 is allocated as the context index by bin to the first bin, and thebypass mode is applied to the second to fourth bins.

Table 18 shows an example where the offset value and the context indexvalue by bin in Table 13 are specifically set. The offset values and thecontext index values by bin in Table 18 can be set to be different fromthe values shown in Table 18 so as to indicate suitable contexts.

By applying different offsets depending on the state information or thecondition, different contexts depending on the condition may beallocated, the same context may be commonly applied to some bins of thebins constituting a codeword of a syntax (syntax element), and thebypass mode may be applied to the other bins. For example, when Table 13is assumed for a predetermined syntax (syntax element), some of thevalues of B0, B1, B2, B3, and B4 can be set to the same index value andthe other of the values of B0, B1, B2, B3, and B4 can be set to indicatethe bypass mode instead of the specific index values.

Table 19 shows an example of a context table which can be used in a casewhere the offset value is set so as to define different contextsdepending on the slice type, the same context is commonly applied tosome bins, and the bypass mode is applied to the other bins.

TABLE 19 Context index by bin Type Offset 0 1 2 3 4 I 0 0 0 bypassbypass bypass P 1 0 0 bypass bypass bypass B 2 0 0 bypass bypass bypass

When Table 19 is assumed to be applied to a predetermine syntax (syntaxelement), 0 is allocated as the context index by bin to the 0-th andfirst bins constituting the codeword of the corresponding syntax (syntaxelement) and the bypass mode is applied to the second to fourth bins.

Table 19 shows an example where the offset value and the context indexvalue by bin in Table 13 are specifically set. The offset values and thecontext index values by bin in Table 19 can be set to be different fromthe values shown in Table 19 so as to indicate suitable contexts.

By applying different offsets depending on the state information or thecondition, different contexts depending on the condition may beallocated, the bypass mode may be applied to one bin of the binsconstituting a codeword of a syntax (syntax element) and the samecontext may be commonly applied to the other bins. For example, whenTable 13 is assumed for a predetermined syntax (syntax element), one binof the values of B0, B1, B2, B3, and B4 can be set to indicate thebypass mode instead of the specific index values and the other of thevalues of B0, B1, B2, B3, and B4 can be set to the same index value.

Table 20 shows an example of a context table which can be used in a casewhere the offset value is set so as to define different contextsdepending on the slice type, the bypass mode is applied to one bin, andthe same context is commonly applied to the other bins.

TABLE 20 Context index by bin Type Offset 0 1 2 3 4 I 0 0 0 0 0 bypass P1 0 0 0 0 bypass B 2 0 0 0 0 bypass

When Table 20 is assumed to be applied to a predetermine syntax (syntaxelement), 0 is allocated as the context index by bin to the 0-th tothird bins constituting the codeword of the corresponding syntax (syntaxelement) and the bypass mode is applied to the fourth bin.

Table 20 shows an example where the offset value and the context indexvalue by bin in Table 13 are specifically set. The offset values and thecontext index values by bin in Table 20 can be set to be different fromthe values shown in Table 20 so as to indicate suitable contexts.

On the other hand, while Tables 13 to 20 show the examples where acodeword of a syntax includes 5 bins, the invention is not limited tothe examples. When the codeword of the syntax (syntax element) to whichTables 13 to 20 includes bins less than 5, for example, n bins (wheren<5), the context index by bin is not allocated to or na (not available)is allocated to the bin index larger than n−1 and equal to or less than4. When the codeword of the syntax (syntax element) to which Table 14 isapplied includes 5 or more bins, the same value as the context index ofthe fifth bin can be allocated as the context index of the binsubsequent to the fifth bin.

While the same context index by bin is applied to the same bin in Tables13 to 20, the invention is not limited to this example, but the value ofthe context index by bin may be set to be different depending on theoffset. For example, the values of Bi (where i=0, 1, 2, 3, 4) may be setto be different for A1 to A3 in Table 13. Specifically, at least one ofthe value of B0 for A1, the value of B0 for A2, and the value of B0 forA3 may be set to be different from the other values of B0.

The examples of Tables 13 to 20 can be applied to a systax (syntaxelement) transmitted in the course of coding. For example, the same istrue of various syntax elements as well as the above-mentioned syntaxelement intra_chroma_pred_mode.

Table 21 shows an example where the above-mentioned details are appliedto various syntax elements.

TABLE 21 ctxIdxTable, binIdx Syntax element ctxIdxOffset 0 1 2 3 >=4sao_type_idx Table 1 0 0 1 1 na na 2 0 1 1 na na 4 0 1 1 na nasao_offset Table 2 0 0 1 2 2 2 3 0 1 2 2 2 6 0 1 2 2 2 cu_qp_delta Table3 0 0 na (uses 1 2 2 Decode Bypass) 3 0 na (uses 1 2 2 Decode Bypass) 60 na (uses 1 2 2 Decode Bypass) prev_intra_luma_pred_flag Table 4 0 0 nana na na 1 0 na na na na 2 0 na na na na intra_chroma_pred_mode Table 50 0 1 na na na (chroma_pred_from_luma_enabled_flag == 2 0 1 na na natrue) 4 0 1 na na na intra_chroma_pred_mode Table 6 0 0 na na na na(chroma_pred_from_luma_enabled_flag == 2 0 na na na na false) 4 0 na nana na

In the example of Table 21, the context index by bin is indicated by binindex (binIdx). The context index by bin is determined as the sum of thevalue of the offset ctxIdxOffset and the value of context index by bin.

The context index determined for a specific bin of a predeterminedsyntax element can indicate a context to be applied to the specific binindicated by the context index table ctxIdxTable for the correspondingsyntax element.

On the other hand, the value of context index by bin may be determinedon the basis of block information (for example, information on a blockstate or a block condition). At this time, the block informationincludes information on neighboring blocks of a block to be decoded inaddition to information on the block to be decoded. The used blockinformation may be information of a coding block, information of aprediction block, or information of a transform block. For example, theblock information can be used to determine contexts of syntax elementssuch as cbf_luma, cbf_cb, and cbf_cr. The syntax elements cbf_luma,cbf_cb, and cbf_cr are syntax elements representing informationindicating whether a luma residual signal is present in a block furtherdivided from a current block in a quad tree structure or whether achroma residual signal is present therein.

Specifically, when coding (encoding/decoding) cbf_luma, cbf_cb, andcbf_cr, the contexts of cbf_luma, cbf_cb, and cbf_cr can be determinedin consideration of the coding unit depth and/or the transform unitdepth of neighboring partitions (blocks) in addition to cbf (Coded BlockFlag) information of the neighboring blocks. For example, the size of acurrent transform unit can be calculated using the coding unit depth andthe transform unit depth, and contexts can be distinguished ordesignated in consideration of the transform unit size of theneighboring partitions at that time.

The contexts may be distinguished or designated using the transform unitsize of a neighboring partition and the cbf of the correspondingpartition. For example, when the contexts of cbf_luma are distinguishedor designated, the contexts of cbf_luma can be individually applied to(1) a case where the values of cbf_luma for neighboring blocks of acurrent block, for example, blocks located on the left side and the topside of the current block are all 0 and the size of the transform unitis equal to or larger than the size of the current transform unit, (2) acase where the value of cbf_luma for a block on any one side out of theneighboring blocks of a current block, for example, blocks located onthe left side and the top side of the current block is 0 and the size ofthe transform unit is equal to or larger than the size of the currenttransform unit, and (3) a case where the values of cbf_luma for theneighboring blocks of a current block, for example, blocks located onthe left side and the top side of the current block are all 1 or thesize of the transform unit is smaller than the size of the currenttransform unit.

This description on cbf_luma can be similarly applied to cbf_cb andcbf_cr. For example, regarding cbf_cr, the contexts of cbf_cr can beindividually applied to (1) a case where the values of cbf_cr forneighboring blocks of a current block, for example, blocks located onthe left side and the top side of the current block are all 0 and thesize of the transform unit is equal to or larger than the size of thecurrent transform unit, (2) a case where the value of cbf_cr for a blockon any one side out of the neighboring blocks of a current block, forexample, blocks located on the left side and the top side of the currentblock is 0 and the size of the transform unit is equal to or larger thanthe size of the current transform unit, and (3) a case where the valuesof cbf_cr for the neighboring blocks of a current block, for example,blocks located on the left side and the top side of the current blockare all 1 or the size of the transform unit is smaller than the size ofthe current transform unit.

Regarding cbf_cb, the contexts of cbf_cb can be individually appliedto 1) a case where the values of cbf_cb for neighboring blocks of acurrent block, for example, blocks located on the left side and the topside of the current block are all 0 and the size of the transform unitis equal to or larger than the size of the current transform unit, (2) acase where the value of cbf_cb for a block on any one side out of theneighboring blocks of a current block, for example, blocks located onthe left side and the top side of the current block is 0 and the size ofthe transform unit is equal to or larger than the size of the currenttransform unit, and (3) a case where the values of cbf_cb for theneighboring blocks of a current block, for example, blocks located onthe left side and the top side of the current block are all 1 or thesize of the transform unit is smaller than the size of the currenttransform unit.

The contexts may be distinguished or designated in consideration of theratio of cbf in a neighboring partition having the same size as thecurrent transform unit. For example, when the contexts of cbf_luma aredistinguished or designated, the contexts of cbf_luma can beindividually distinguished or designated in (1) a case where the ratioat which the value of cbf_luma in a neighboring partition having thesame size as the current transform unit is 0 in two directions of theneighbors (for example, the left side and the top side) of the currentblock is equal to or more than 50%, (2) a case where the ratio at whichthe value of cbf_luma in a neighboring partition having the same size asthe current transform unit is 0 in only one direction of the neighbor(for example, the left side and the top side) of the current block isequal to or more than 50%, and (3) a case where the ratio at which thevalue of cbf_luma in a neighboring partition having the same size as thecurrent transform unit is 0 in two directions of the neighbors (forexample, the left side and the top side) of the current block is lessthan 50%.

This description on cbf_luma can be similarly applied to cbf_cb andcbf_cr.

For example, regarding cbf_cr, the contexts of cbf_cr can beindividually distinguished or designated in (1) a case where the ratioat which the value of cbf_cr in a neighboring partition having the samesize as the current transform unit is 0 in two directions of theneighbors (for example, the left side and the top side) of the currentblock is equal to or more than 50%, (2) a case where the ratio at whichthe value of cbf_cr in a neighboring partition having the same size asthe current transform unit is 0 in only one direction of the neighbor(for example, the left side and the top side) of the current block isequal to or more than 50%, and (3) a case where the ratio at which thevalue of cbf_cr in a neighboring partition having the same size as thecurrent transform unit is 0 in two directions of the neighbors (forexample, the left side and the top side) of the current block is lessthan 50%.

Regarding cbf_cb, the contexts of cbf_cb can be individuallydistinguished or designated in (1) a case where the ratio at which thevalue of cbf_cb in a neighboring partition having the same size as thecurrent transform unit is 0 in two directions of the neighbors (forexample, the left side and the top side) of the current block is equalto or more than 50%, (2) a case where the ratio at which the value ofcbf_cb in a neighboring partition having the same size as the currenttransform unit is 0 in only one direction of the neighbor (for example,the left side and the top side) of the current block is equal to or morethan 50%, and (3) a case where the ratio at which the value of cbf_cb ina neighboring partition having the same size as the current transformunit is 0 in two directions of the neighbors (for example, the left sideand the top side) of the current block is less than 50%.

The contexts may be distinguished or designated in consideration of theratio of cbf in plural neighboring partitions. The context may be simplydistinguished or designated in consideration of the cbf of pluralneighboring partitions. For example, when the contexts of cbf_luma aredistinguished or designated, the contexts of cbf_luma can beindividually distinguished or allocated in (1) a case where the valuesof cbf_luma for sample partitions in two directions of the neighbors(for example, the left side and the top side) of the current block areall 0, (2) a case where the value of cbf_luma for sample partitions inonly one direction of the neighbor (for example, the left side and thetop side) of the current block is 0, and (3) a case where any value ofcbf_luma for sample partitions in two directions of the neighbors (forexample, the left side and the top side) of the current block is 1.

This description on cbf_luma can be similarly applied to cbf_cb andcbf_cr.

For example, regarding cbf_cr, the contexts of cbf_cr can beindividually distinguished or allocated in (1) a case where the valuesof cbf_cr for sample partitions in two directions of the neighbors (forexample, the left side and the top side) of the current block are all 0,(2) a case where the value of cbf_cr for sample partitions in only onedirection of the neighbor (for example, the left side and the top side)of the current block is 0, and (3) a case where any value of cbf_cr forsample partitions in two directions of the neighbors (for example, theleft side and the top side) of the current block is 1.

Regarding cbf_cb, the contexts of cbf_cb can be individuallydistinguished or allocated to (1) a case where the values of cbf_lumafor sample partitions in two directions of the neighbors (for example,the left side and the top side) of the current block are all 0, (2) acase where the value of cbf_luma for sample partitions in only onedirection of the neighbor (for example, the left side and the top side)of the current block is 0, and (3) a case where any value of cbf_lumafor sample partitions in two directions of the neighbors (for example,the left side and the top side) of the current block is 1.

A method of selecting a neighboring partition by a predetermined unitsuch as a least transform unit can be used as the method of selecting aneighboring partition. At this time, the least transform unit can bedetermined using the RQT (Residual Quad Tree) maximum depth.

A method of selecting a predetermined number of neighboring partitionsby the least transform unit may be used as the method of selecting aneighboring partition. For example, two partitions may be selected bythe least transform unit out of the neighboring partitions.

On the other hand, the above-mentioned methods used to distinguish ordesignate the contexts of cbf_luma, cbf_cr, and cbf_cb can be similarlyapplied to other syntax elements, for example, no_residual_data_flagindicating the presence of a residual signal.

For example, the contexts may be distinguished or designated using thetransform unit size of a neighboring partition and no_residual_data_flagof the neighboring partition. Specifically, when the contexts ofno_residual_data_flag are distinguished or designated, the contexts ofno_residual_data_flag can be individually applied to (1) a case wherethe values of no_residual_data_flag for neighboring blocks of a currentblock, for example, blocks located on the left side and the top side ofthe current block are all 0 and the size of the transform unit is equalto or larger than the size of the current transform unit, (2) a casewhere the value of no_residual_data_flag for a block on any one side outof the neighboring blocks of a current block, for example, blockslocated on the left side and the top side of the current block is 0 andthe size of the transform unit is equal to or larger than the size ofthe current transform unit, and (3) a case where the values ofno_residual_data_flag for the neighboring blocks of a current block, forexample, blocks located on the left side and the top side of the currentblock are all 1 or the size of the transform unit is smaller than thesize of the current transform unit.

The contexts may be distinguished or designated in consideration of theratio of no_residual_data_flag in a neighboring partition having thesame size as the size of the current transform unit. For example, whenthe contexts of no_residual_data_flag are distinguished or designated,the contexts of no_residual_data_flag can be individually distinguishedor designated in (1) a case where the ratio at which the value ofno_residual_data_flag in a neighboring partition having the same size asthe current transform unit is 0 in two directions of the neighbors (forexample, the left side and the top side) of the current block is equalto or more than 50%, (2) a case where the ratio at which the value ofno_residual_data_flag in a neighboring partition having the same size asthe current transform unit is 0 in only one direction of the neighbor(for example, the left side and the top side) of the current block isequal to or more than 50%, and (3) a case where the ratio at which thevalue of no_residual_data_flag in a neighboring partition having thesame size as the current transform unit is 0 in two directions of theneighbors (for example, the left side and the top side) of the currentblock is less than 50%.

The contexts may be distinguished or designated in consideration of theratio of no_residual_data_flag in plural neighboring partitions. Thecontexts may be distinguished or designated in consideration ofno_residual_data_flag of plural neighboring partitions. For example,when the contexts of no_residual_data_flag are distinguished ordesignated, the contexts of no_residual_data_flag can be individuallydistinguished or allocated to (1) a case where the values ofno_residual_data_flag for sample partitions in two directions of theneighbors (for example, the left side and the top side) of the currentblock are all 0, (2) a case where the value of no_residual_data_flag forsample partitions in only one direction of the neighbor (for example,the left side and the top side) of the current block is 0, and (3) acase where the values of no_residual_data_flag for sample partitions intwo directions of the neighbors (for example, the left side and the topside) of the current block are all 1.

Table 22 shows an example of a context table which can be applied to acase where the value of the context index by bin is determined on thebasis of the information on neighbors.

TABLE 22 ctxIdxTable, binIdx Syntax element cfcIdxOffset 0 1 2 3 >=4split_transform_flag Table A 0 cuDepth + trafoDepth na na na na 4cuDepth + trafoDepth na na na na 8 cuDepth + trafoDepth na na na nacbf_luma Table B 0 ( trafoDepth = = 0 ) | | na na na na ( log2TrafoSize= = Log2MaxTrafoSize) ? 1 : 0 2 ( trafoDepth = = 0 ) | | na na na na (log2TrafoSize = = Log2MaxTrafoSize) ? 1 : 0 4 ( trafoDepth = = 0 ) | |na na na na ( log2TrafoSize = = Log2MaxTrafoSize) ? 1 : 0 cbf_cb, cbf_crTable C 0 trafoDepth na na na na 3 trafoDepth na na na na 6 trafoDepthna na na na

Referring to Table 22, the value of the context index of the 0-th binout of the bins constituting the codeword of a syntax element splittransform flag can be determined by the block information. For example,the context index value of the 0-th bin of split transform flag isdetermined by the information of the coding unit depth and the transformunit depth.

In the example of Table 22, the values of the context index of the 0-thbin out of the bins constituting the codewords of the syntax elementscbf_luma, cbf_cb, and cbf_cr are determined by the block information,for example, the information of the transform unit depth. For example,in the syntax element cbf_luma, when the transform unit depth of the0-th bin is 0 or the transform unit size is the maximum size, 1 can beallocated as the context index by bin.

While the methods in the above-mentioned exemplary system have beendescribed on the basis of a series of steps or a flowchart, theinvention is not limited to the order of the steps and a certain stepmay be performed in an order other than described above or at the sametime as described above. The above-mentioned embodiments include variousexamples.

Therefore, the invention includes embodiments in which theabove-mentioned embodiments are simultaneously applied or combined.

The invention claimed is:
 1. A method of decoding video by decodingapparatus, the method comprising: deriving context information on atleast one bin among bins of a bin string for a syntax element; decodingthe bins of the bin string, wherein a part of bins in the bin string aredecoded based on the context information and remaining bins in the binstring are decoded by a bypass decoding; deriving a value of the syntaxelement based on the decoded bins; and deriving prediction samples basedon the value of the syntax element; and deriving reconstructed samplesusing the prediction samples.
 2. The method of claim 1, wherein the stepof decoding bins includes applying contexts which are independent eachother to each bins of the bin string for the syntax element.
 3. Themethod of claim 1, wherein the step of decoding bins includes applying abypass decoding on some bins of the bin string for the syntax elementand applying contexts which are independent each other to the other binsof the bin string for the syntax element.
 4. The method of claim 1,wherein in the step of the decoding bins, independent context is appliedto the bin which is decoded based on the context information, andwherein the independent context is a context which is updatedindependently with other context.
 5. The method of claim 1, wherein thestep of decoding bins includes, determining whether the bypass decodingis performed on a bin of the bin string for the syntax element; anddecoding the bin based on the context information when it is determinedthat the bypass decoding is not performed on the bin.
 6. The method ofclaim 1, wherein the step of decoding bins includes decoding a bin ofthe bin string for the syntax element based on a context index assignedto the bin on a context index table which assigns a context index to abin corresponding to a syntax element.
 7. The method of claim 6, whereinthe context index table assigns same context indices for at least twobins of the bin string for the syntax element.
 8. The method of claim 6,wherein the context index table assigns same context indices to somebins of the bin string for the syntax element, and assigns a bypassdecoding to the other bins of the bin string for the syntax element. 9.The method of the claim 1, wherein, in the step of decoding bins, thebin is decoded using a context index table, wherein the context indextable allocates an offset corresponding to a picture type for a pictureto be decoded and context index for a bin of the bin string for thesyntax element, and wherein the bin of the bin string for the syntaxelement is decoded based on a context indicated by the context index andthe offset.
 10. The method of claim 9, wherein the context index tableassigns same context indices to at least two bins of the bin string forthe syntax element.
 11. The method of claim 9, wherein the context indextable assigns same context indices to some bins of the bin string forthe syntax element, and assigns a bypass decoding to the other bins ofthe bin string for the syntax element.
 12. The method of claim 1,wherein a binary code of the bin is decoded as it is not using a contextwhen the bypass decoding is performed.
 13. The method of claim 1,wherein, in the step of deriving context information, the contextinformation is indicated by a sum of a context index offset and acontext index by the bin, and wherein the context index offset isdetermined based on slice type for a current among slice is I slice, Pslice and B slice.
 14. The method of claim 13, wherein, in the step ofderiving context information, the bin is a first bin of the codeword forwhich is a bin index of 0 is allocated, and the bypass decoding isperformed on the rest bins of the codeword.
 15. The method of claim 1,wherein the syntax element is intra_chroma_pred_mode which specify intraprediction mode for a chroma sample.
 16. The method of claim 15, whereinthe step of decoding bins includes performing an arithmetic decoding ona first bin of a bin string for the syntax elementintra_chroma_pred_mode based on the context information; and performinga bypass decoding on rest bins of the bin string for the syntax elementintra_chroma_pred_mode.
 17. The method of claim 15, wherein the step ofdecoding bins includes performing the bypass decoding bins of a binstring for the syntax element intra_chroma_pred_mode from a second binof the bin string; and wherein the step of deriving the contextinformation includes deriving context information on a first bin of thebin string for the syntax element intra_chroma_pred_mode.
 18. The methodof claim 17, wherein the context information is specified by a sum ofcontext index offset and a context index by the bin, and wherein thecontext index offset has a value of 0 when a current slice is an Islice, a value of 1 when the current slice is a P slice, and a value of2 when the current slice is a B slice.